Formal science - PDFSEARCH.IO - Document Search Engine

Formal science
Results: 4621

#	Item
91	What Not to Do When Writing an Interpreter for Specialisation Neil D. Jones DIKU, University of Copenhagen e-mail: Add to Reading List Source URL: repository.readscheme.org Language: English - Date: 2010-10-22 08:04:36 Software engineering Computing Theoretical computer science Logic in computer science Models of computation Programming language semantics Formal methods Subroutines Denotational semantics Semantics Partial evaluation Interpreter
92	C Program Specialization Master’s Thesis (revised version) Lars Ole Andersen DIKU, Department of Computer Science, Add to Reading List Source URL: repository.readscheme.org Language: English - Date: 2010-10-22 08:05:06 Software engineering Computing Computer programming Logic in computer science Formal methods Programming language implementation Functional languages Programming paradigms Partial evaluation Programming language Operational semantics Functional programming
93	TIP: Tons of Inductive Problems Koen Claessen, Moa Johansson, Dan Ros´en, and Nicholas Smallbone Department of Computer Science and Engineering, Chalmers University of Technology {koen,jomoa,danr,nicsma}@chalmers.se Ab Add to Reading List Source URL: www.cse.chalmers.se Language: English - Date: 2015-05-06 07:44:21 Software engineering Theoretical computer science Automated theorem proving Mathematics Logic in computer science Functional languages Formal methods Reasoning Satisfiability modulo theories Rippling Automated reasoning IP
94	external datasets internal datasets alerts applications business process optimization Add to Reading List Source URL: bigdatascienceschool.com Language: English - Date: 2014-06-10 14:22:06 Computing Data Information technology Data management Business intelligence Big data Formal sciences Transaction processing Analytics Data set Data analysis Data science
95	How recursive is language? 1 Running head: HOW RECURSIVE IS LANGUAGE? How recursive is language? A Bayesian exploration Amy Perfors Add to Reading List Source URL: tedlab.mit.edu Language: English - Date: 2012-08-09 14:58:51 Cognitive science Formal languages Language Grammar Linguistics Syntax Compiler construction Philosophy of language Recursive grammar Context-free grammar Parsing Recursion
96	An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2010-05-19 04:29:26 Theoretical computer science Automated planning and scheduling Logic in computer science Mathematics Computational complexity theory Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Maximum satisfiability problem Planning Domain Definition Language Satz
97	to appear in TCS – www.wischik.com/lu/research/explicit-fusions.html Explicit Fusions Lucian Wischik1 and Philippa Gardner2 1 2 Add to Reading List Source URL: www.wischik.com Language: English - Date: 2004-02-23 13:34:35 Theoretical computer science Mathematical logic Logic Formal methods Logic in computer science Process calculi -calculus Automated theorem proving Process calculus Lambda calculus Bisimulation Limit of a function
98	Inducing Suffix and LCP Arrays in External Memory Timo Bingmann∗, Johannes Fischer†, and Vitaly Osipov‡ KIT, Institute of Theoretical Informatics, 76131 Karlsruhe, Germany {timo.bingmann,johannes.fischer,osipov}@ki Add to Reading List Source URL: panthema.net Language: English - Date: 2012-11-28 08:24:55 String computer science) Computing Computer programming Arrays Formal languages LCP array Suffix array Combinatorics on words String Suffix tree Trie Substring
99	The Whiley Rewrite Language (WyRL) David J. Pearce School of Engineering and Computer Science, Victoria University of Wellington, New Zealand Abstract Add to Reading List Source URL: homepages.ecs.vuw.ac.nz Language: English - Date: 2015-08-18 20:05:39 Software engineering Programming language theory Computer programming Logic in computer science Formal languages Procedural programming languages Subroutines Computability theory Rewriting Recursion Whiley ALGOL 68
100	Let tests drive or let Dijkstra derive? Presented at ALE2014 in Krakow Poland on August 21, 2014 Author: Sander Kooijmans Date: November 3, 2014 Why this document? Add to Reading List Source URL: www.gogognome.nl Language: English - Date: 2016-04-05 02:15:07 Formal methods Theoretical computer science Software engineering Mathematics Hoare logic Static program analysis Algorithm Precondition Predicate transformer semantics Loop invariant

UPDATE